WORST_CASE(?,O(n^2))

Solution:
---------

  "a__f" :: ["A"(8, 7) x "A"(0, 0)] -(3)-> "A"(1, 7)
  "f" :: ["A"(12, 7) x "A"(0, 0)] -(5)-> "A"(5, 7)
  "f" :: ["A"(0, 0) x "A"(0, 0)] -(0)-> "A"(0, 0)
  "f" :: ["A"(8, 7) x "A"(0, 0)] -(1)-> "A"(1, 7)
  "g" :: ["A"(15, 7)] -(8)-> "A"(8, 7)
  "g" :: ["A"(12, 7)] -(5)-> "A"(5, 7)
  "g" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "g" :: ["A"(8, 7)] -(1)-> "A"(1, 7)
  "mark" :: ["A"(5, 7)] -(7)-> "A"(1, 7)


Cost Free Signatures:
---------------------

  "a__f" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "a__f" :: ["A"_cf(7, 0) x "A"_cf(0, 0)] -(7)-> "A"_cf(7, 0)
  "f" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "f" :: ["A"_cf(7, 0) x "A"_cf(0, 0)] -(7)-> "A"_cf(7, 0)
  "g" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "g" :: ["A"_cf(7, 0)] -(7)-> "A"_cf(7, 0)
  "mark" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "mark" :: ["A"_cf(7, 0)] -(0)-> "A"_cf(7, 0)
  "mark" :: ["A"_cf(7, 0)] -(3)-> "A"_cf(7, 0)


Base Constructors:
------------------
  "\"f\"_A" :: ["A"(1, 0) x "A"(0, 0)] -(1)-> "A"(1, 0)
  "\"f\"_A" :: ["A"(1, 1) x "A"(0, 0)] -(0)-> "A"(0, 1)
  "\"g\"_A" :: ["A"(1, 0)] -(1)-> "A"(1, 0)
  "\"g\"_A" :: ["A"(1, 1)] -(0)-> "A"(0, 1)